Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
51	Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki Add to Reading List Source URL: rutcor.rutgers.edu Language: English Computational complexity theory Theory of computation Analysis of algorithms Order theory Parameterized complexity NP Exponential time hypothesis Randomized algorithm Time complexity Partially ordered set Order dimension
52	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
53	Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2016-07-30 09:35:21 Theoretical computer science Theory of computation Computational complexity theory Quantum algorithms Quantum computing Models of computation Decision tree model Quantum phase estimation algorithm PP Quantum walk Time complexity Quantum information
54	Multivariate Power Series Multiplication ´ ´ Eric Schost, LIX, Ecole polytechnique Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2005-03-15 15:18:47 Mathematics Algebra Abstract algebra Polynomials Multiplication Commutative algebra Interpolation ToomCook multiplication Lagrange polynomial Multiplication algorithm Discrete Fourier transform Time complexity
55	Algorithmic Techniques for Geometric Optimization? Pankaj K. Agarwal1 and Micha Sharir2;3 1 Department of Computer Science Box 90129, Duke University, Durham, NC, USA. Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2012-06-29 03:18:26 Computer science Mathematics Computational complexity theory Analysis of algorithms Combinatorial optimization Theoretical computer science Parametric search Computational geometry Algorithm Time complexity Selection algorithm Bounding sphere
56	fea-mcgeoch.qxp:58 AM Add to Reading List Source URL: www.ams.org Language: English - Date: 2001-02-16 13:50:35 Computational complexity theory Theory of computation Mathematics Complexity classes Analysis of algorithms Graph coloring Theoretical computer science Algorithm NP Time complexity Greedy algorithm P
57	MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and Add to Reading List Source URL: www.keisu.t.u-tokyo.ac.jp Language: English - Date: 2013-01-25 04:57:12 Computational complexity theory Mathematics Operations research Algebra Linear algebra Linear complementarity problem Mathematical optimization Linear programming NP Inequality Time complexity LCP array
58	DRIVE DISCOVERY WITH THE MOST COMPLETE VIEW OF CANCER COMPLEXITY CANCER RESEARCH Single Molecule, Real-Time (SMRT®) Sequencing drives discovery in cancer research by providing Add to Reading List Source URL: www.pacb.com Language: English - Date: 2015-10-30 16:14:21 Biology Molecular biology Biotechnology Evolutionary biology Gene expression RNA RNA-Seq The Cancer Genome Atlas Pacific Biosciences Whole genome sequencing Mutation DNA sequencing
59	De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:27 Mathematics Graph theory Computational complexity theory Combinatorial optimization Matching Degree Connectivity Draft:Sub-linear time algorithm Planar separator theorem
60	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma

UPDATE